Computing Strong Nash Equilibria for Multiplayer Games

نویسندگان

  • Noémi Gaskó
  • Rodica Ioana Lung
  • Dumitru Dumitrescu
چکیده

A new method for computing strong Nash equilibria in multiplayer games that uses the theoretical framework of generative relations combined with a stochastic search method is presented. Generative relations provide a mean to compare two strategy profiles and to assess their relative quality with respect to an equilibria type. The stochastic method used, called Aumann Crowding Based Differential Evolution (A-CrDE), uses a Differential Evolution algorithm that has been successfully used for numerical optimization problem. Numerical experiments illustrate the efficiency of the approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nash Equilibria in Symmetric Games with Partial Observation

We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undeci...

متن کامل

Nash equilibria in symmetric graph games with partial observation

We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undeci...

متن کامل

Subgame Perfection for Equilibria in Quantitative Reachability Games

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

متن کامل

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

متن کامل

The Complexity of Nash Equilibria in Infinite Multiplayer Games

We study the complexity of Nash equilibria in infinite (turnbased, qualitative) multiplayer games. Chatterjee & al. showed the existence of a Nash equilibrium in any such game with ω-regular winning conditions, and they devised an algorithm for computing one. We argue that in applications it is often insufficient to compute just some Nash equilibrium. Instead, we enrich the problem by allowing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1405.0108  شماره 

صفحات  -

تاریخ انتشار 2014